#include "Sort.h"

int main()
{
	My_Sort s;
	int arr[] = { 9,8,7,6,5,4,3,2,1,0 };
	int n = sizeof(arr) / sizeof(arr[0]);
	//s.InsertSort(arr, n);
	//s.ShellSort(arr, n);
	//s.BubbleSort(arr, n);
	//s.HeapSort(arr, n);
	//s.QuickSort(arr, 0, n - 1);
	s.MergeSort(arr, n);
	s.Print(arr, n);
	cout << s.BinSearch(arr, n, 1) << endl;
	return 0;
}